Facets for the cut cone I

نویسندگان

  • Michel Deza
  • Monique Laurent
چکیده

We study facets of the cut cone C,, i.e., the cone of dimension 1⁄2n(n 1) generated by the cuts of the complete graph on n vertices. Actually, the study of the facets of the cut cone is equivalent in some sense to the study of the facets of the cut polytope. We present several operations on facets and, in particular, a "'lifting" procedure for constructing facets of C~ +1 from given facets of the lower dimensional cone C A. After reviewing hypermetric valid inequalities, we describe the new class of cycle inequalities and prove the facet property for several subclasses. The new class of parachute facets is developed and other known facets and valid inequalities are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Facets for the cut cone II: Clique-web inequalities

We study new classes of facets for the cut cone C, generated by the cuts of the complete graph on n vertices. This cone can also be interpreted as the cone of all semi-metrics on n points that are isometrically l~-embeddable and, in fact, the study of the facets of the cut polytope is in some sense equivalent to the study of the facets of C~. These new facets belong to the class of clique-web i...

متن کامل

Collapsing and lifting for the cut cone

The cut polytope P,(G) of a graph G is the convex hull of the incidence vectors of all cuts of G; the cut cone C(G) of G is the cone generated by the incidence vectors of all cuts of G. We introduce the operation of collapsing an inequality valid over the cut cone C(K,) of the complete graph with n vertices: it consists of identifying vertices and adding the weights of the corresponding inciden...

متن کامل

The inequicut cone

Deza, M., K. Fukuda and M. Laurent, The inequicut cone, Discrete Mathematics 119 (1993) 21-48. Given a complete graph K, on n nodes and a subset S of nodes, the cut 6(S) defined by S is the set of edges of K, with exactly one endnode in S. A cut 6(S) is an equicut if ISI =L n/2 1 or r n/2 1 and an inequicut, otherwise. The cut cone C. (or inequicut cone 1C.) is the cone generated by the inciden...

متن کامل

The cut cone III: On the role of triangle facets

The cut polytope P. is the convex hull of the incidence vectors of the cuts (i.e. complete bipartite subgraphs) of the complete graph on n nodes. A well known class of facets of P. arises from the triangle inequalities: x o + Xlk + X~k < 2 and xlj -x~k -xjk < 0 for 1 < i, j, k < n. Hence, the metric polytope M., defined as the solution set of the triangle inequalities, is a relaxation of P.. We...

متن کامل

On the binary solitaire cone

The solitaire cone SB is the cone of all feasible fractional Solitaire Peg games. Valid inequalities over this cone, known as pagoda functions, were used to show the infeasibility of various peg games. The link with the well studied dual metric cone and the similarities between their combinatorial structures see (3) leads to the study of a dual cut cone analogue; that is, the cone generated by ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 56  شماره 

صفحات  -

تاریخ انتشار 1992